Phase diagram for the Grover algorithm with static imperfections
نویسندگان
چکیده
منابع مشابه
Phase Condition for the Grover Algorithm
Quantum algorithms standardly use two techniques: Fourier transforms [1] and amplitude amplification. The Grover search algorithm is based on the latter. The problem addressed by the Grover algorithm is to find a marked term (or target term in [2]) in an unsorted database of size N . To accomplish this, a quantum computer needs O (√ N ) queries using the Grover algorithm [3]. In Grover’s origin...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA new algorithm for the automation of phase diagram calculation
We propose a new algorithm for minimizing the Gibbs energy functional and constructing phase diagrams through utilizing geometric properties of the energy surfaces together with effective sampling techniques to improve on the starting points for the minimization. The new method possesses advantages over existing methods in terms of computational complexity and can be used to automate the calcul...
متن کاملGrover search algorithm
A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. A quantum system can undergo two types of operation, measurement and quantum state transformation, operations themselves must be unitary (reversible). Most quantum algorithms involve a series of quantum state transformations followed b...
متن کاملExactness of the Original Grover Search Algorithm
Zijian Diao Mathematics Department, Ohio University Eastern Campus, St Clairsville, OH 43950, USA∗ Abstract It is well-known that when searching one out of four, the original Grover’s search algorithm is exact; that is, it succeeds with certainty. It is natural to ask the inverse question: If we are not searching one out of four, is Grover’s algorithm definitely not exact? In this article we gi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The European Physical Journal D
سال: 2004
ISSN: 1434-6060,1434-6079
DOI: 10.1140/epjd/e2004-00113-4